Graph search is used when the search space is structured as a graph or network. Often tree search algorithms can be adapated for graph search by treating all the nodes connected to given node as 'children', but care has to be taken as this is effectvely building the tree of all possible paths on the fly; the algorithm has to keep track of a list of previously visited nodes on the current paths to prevent loops and infinite regress and when possible and meaningful remember the partial resullts when the same node is visited along two different paths.
Defined on pages 70, 70
Used on Chap. 4: pages 60, 61, 70
Also known as graph
Towers of Hanoi: graph of possible states and moves.
Addition proof graph.